Equilibrium uniqueness in entry games with private information

Equilibrium existence and uniqueness in network games with additive preferences

Efficiency in Games with Markovian Private Information

We study repeated Bayesian games with communication and observable actions in which the players’ privately-known payoffs evolve according to an irreducible Markov chain whose transitions are independent across players. Our main result implies that, generically, any Pareto-efficient payoff vector above a stationary minmax value can be approximated arbitrarily closely in a perfect Bayesian equili...

Bounding equilibrium payoffs in repeated games with private monitoring

We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff set with perfect monitoring and a mediator. We show that this bounding set admits a simple recursive...

Delay and information aggregation in stopping games with private information

We consider equilibrium timing decisions in a model with a large number of players and informational externalities. The players have private information about a common payo¤ parameter that determines the optimal time to invest. They learn from each other in real time by observing past investment decisions. We develop new methods of analysis for such large games, and we give a full characterizat...

Generic Uniqueness of Equilibrium in Large Crowding Games

A crowding game is a noncooperative game in which the payo¤ of each player depends only on the player’s action and the size of the set of players choosing that particular action: The larger the set, the smaller the payo¤. Finite, n-player crowding games often have multiple equilibria. However, a large crowding game generically has just one equilibrium, and the equilibrium payo¤s in such a game ...